Improved Low Complexity Fully Parallel Thinning Algorithm
نویسندگان
چکیده
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation invariance and noise immunity, while featuring a speed improvement by a factor two or more owing to a smaller number of operations to perform. MB2 is grounded on a simple physics-based thinning principle that conveys both quality, efficiency and conceptual clarity. It is particularly suited to data parallel execution.
منابع مشابه
An improved fully parallel 3D thinning algorithm
A 3D thinning algorithm erodes a 3D image layer by layer to extract the skeletons. This paper presents an improved fully parallel 3D thinning algorithm which extracts medial lines from a 3D image. This algorithm is based on Ma and Sonka’s thinning algorithm [16], which fails to preserve connectivity of 3D objects. We start with Ma and Sonka’s algorithm and examine its verification of connectivi...
متن کاملAn Improved Cost-Efficient Thinning Algorithm for Digital Image
Digital image processing plays an important role in our everevolving ubiquitous information society with an increasing need of automatic and efficient information collection. Thinning algorithms have been widely developed and applied in Optical Character Recognition (OCR) to eliminate the redundant data as well as keep the essential features of digital images. Inspired by the in-depth analysis ...
متن کاملLow Complexity Converter for the Moduli Set {2^n+1,2^n-1,2^n} in Two-Part Residue Number System
Residue Number System is a kind of numerical systems that uses the remainder of division in several different moduli. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers will increase the speed of the arithmetic operations in this system. However, the main factor that affects performance of system is hardware complexity of reverse converter. Reverse co...
متن کاملPattern Reconstructability in Fully Parallel Thinning
It is a challenging topic to perform pattern reconstruction from a unit-width skeleton, which is obtained by a parallel thinning algorithm. The bias skeleton yielded by a fully-parallel thinning algorithm, which usually results from the so-called hidden deletable points, will result in the difficulty of pattern reconstruction. In order to make a fully-parallel thinning algorithm pattern reconst...
متن کاملParallel Thinning with Two-
Two parallel thinning algorithms are presented and evaluated in this article. The two algorithms use two-subiteration approaches: (1) alternatively deleting north and east and then south and west bounda y pixels and (2) alternately applying a thinning operator to one of two subfields. image connectivities are proven to be preserved and the algorithms’ speed and medial curve thinness are compare...
متن کامل